Task Migration Transfers in Multistage Cube Based Parallel Systems

Optimizing Task Migration Transfers Using Multistage Cube Networks

As hardware and software technology progresses, the interest in large-scale parallel processing systems is increasing. Making such a system partitionable into independent subsystems has many advantages. To maximize these benefits, it may be necessary to move (migrate) a job from one submachine (partition) to another. Here, machines based on multistage cube networks are considered. Assume the ta...

Large-scale parallel processing systems

Parallel processing is an area of growing interest to the computer science and engineering communities. This paper is an introduction to some of the concepts involved in the design and use of large-scale parallel systems. Parallel machines that are classified as SIMD (synchronous) and MIMD (asynchronous) systems, composed of a large number of microprocessors, are explored. Parallel algorithms a...

Design and Analysis of Dynamic Redundancy Networks

Most previous work in the fault-tolerant design of multistage interconnection networks (MIN’s) has been based on improving the reliabilities of the networks themselves. For parallel systems containing a large number of processing elements (PE’s), the capability to recover from a PE fault is also important. The dynamic redundancy (DR) network is investigated in this paper. It can tolerate faults...

Using the Multistage Cube Network Topology in Parallel Supercomputers. in Interconnection Networks for Large-scale Parallel Processing

A Distributed Management Scheme for Partitionable Parallel Computers

Many large-scale parallel computers, such as those based on hypercube or multistage cube interconnection networks, can be partitioned to process applications with different computation structures and different degrees of parallelism simultaneously. However, partitioning may create resource fragments and may result in a loss of computation power. Dynamic Partitioning is an effective method to al...